翻訳と辞書 Words near each other ・ Klakar ・ Klake ・ Klake, Kozje ・ Klakkane Islands ・ Klakknabben Peak ・ Klakorina ・ Klakowo ・ Klaksvík ・ KLAL ・ Klal Israël ・ Klal Yisrael ・ Klallam ・ Klallam language ・ KLAM ・ Klam ・ Klam value ・ Klamath ・ Klamath (album) ・ Klamath Agency, Oregon ・ Klamath Air Force Station ・ Klamath and Salmon River War ・ Klamath Basin ・ Klamath Basin National Wildlife Refuge Complex ・ Klamath Basin Restoration Agreement ・ Klamath Community College ・ Klamath County ・ Klamath County Event Center ・ Klamath County School District ・ Klamath County, California ・ Klamath County, Oregon Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Klam value ： ウィキペディア英語版 Klam value In the parameterized complexity of algorithms, the klam value of a parameterized algorithm is a number that bounds the parameter values for which the algorithm might reasonably be expected to be practical.〔.〕 An algorithm with a higher klam value can be used for a wider range of parameter values than another algorithm with a lower klam value. The klam value was first defined by ,〔.〕〔 uses the klam value and was published earlier than , but gives credit to Downey and Fellows for the concept.〕 and has since been used by other researchers in parameterized complexity both as a way of comparing different algorithms to each other and in order to set goals for future algorithmic improvements. ==Definition== An algorithm is said to be fixed-parameter tractable if the number of elementary operations it performs has a bound of the form $O(n^c)+f(k)$, where $n$ is some measure of the input size (such as the number of vertices in a graph), $k$ is a parameter describing the complexity of the input (such as the treewidth of the graph), $c$ is a constant that does not depend on $n$ or $k$, and $f$ is a computable function. Given a time bound of this form, the klam value of the algorithm (or more properly of the time bound) is defined to be the largest value of $k$ such that $f(k)$ does not exceed "some reasonable absolute bound on the maximum number of steps of any computation".〔 More precisely both and use the number 1020 as this bound, and this has been followed by later researchers. To prevent artificially improving the klam value of an algorithm by putting more of its complexity into the $O(n^c)$ part of the time bound, also limit $c$ to be at most three, valid for many known fixed-parameter tractable algorithms. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Klam value」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.